A New Petrov--Galerkin Smoothed Aggregation Preconditioner for Nonsymmetric Linear Systems
نویسندگان
چکیده
Introduction We propose a new variant of smoothed aggregation (SA) suitable for nonsymmetric linear systems. SA is a highly successful and popular algebraic multigrid method for symmetric positive-definite systems [3, 2]. A relatively large number of significant parallel smoothed aggregation codes have been developed at universities, companies, and laboratories. Many of these codes are quite sophisticated and represent a significant investment in time and effort. Despite the large body of work on multigrid methods for fluid dynamics and the significant successes of smoothed aggregation, there have been surprisingly few attempts at generalizing the smoothed aggregation idea to nonsymmetric systems. Most smoothed aggregation variants for nonsymmetric systems either sacrifice performance on diffusion-dominated problems or do not perform well on highly convective problems. In this talk, a new variant is proposed that performs well in both the highly diffusive and highly convective regimes. The new algorithm is based on two key generalizations of SA: restriction smoothing and local damping. Restriction smoothing refers to the smoothing of a tentative restriction operator via a damped Jacobi-like iteration. Restriction smoothing is analogous to prolongator smoothing in standard SA and in fact has the same form as the transpose of prolongator smoothing when the matrix is symmetric. Local damping refers to damping parameters used in the Jacobi-like iteration. In standard SA, a single damping parameter is computed via an eigenvalue computation. Here, local damping parameters are computed by considering the minimization of an energy-like quantity for each individual grid transfer basis function. Restrictor Smoothing and Local Damping Let A refer to a discretized partial differential equation, P be an interpolation operator, and R be a restriction operator. The key to any algebraic multigrid scheme is the precise definition of P and R. In standard smoothed aggregation, P is normally defined by
منابع مشابه
Towards Adaptive Smoothed Aggregation (αsa) for Nonsymmetric Problems
Applying smoothed aggregation multigrid (SA) to solve a nonsymmetric linear system, Ax = b, is often impeded by the lack of a minimization principle that can be used as a basis for the coarse-grid correction process. This paper proposes a Petrov-Galerkin (PG) approach based on applying SA to either of two symmetric positive definite (SPD) matrices, √ AtA or √ AAt. These matrices, however, are t...
متن کاملAnalysis of an Algebraic Petrov-Galerkin Smoothed Aggregation Multigrid Method
We give a convergence estimate for a Petrov-Galerkin Algebraic Multigrid method. In this method, the prolongations are defined using the concept of smoothed aggregation while the restrictions are simple aggregation operators. The analysis is carried out by showing that these methods can be interpreted as variational Ritz-Galerkin ones using modified transfer and smoothing operators. The estimat...
متن کاملNon-Galerkin Multigrid Based on Sparsified Smoothed Aggregation
Algebraic Multigrid (AMG) methods are known to be efficient in solving linear systems arising from the discretization of partial differential equations and other related problems. These methods employ a hierarchy of representations of the problem on successively coarser meshes. The coarse-grid operators are usually defined by (Petrov-)Galerkin coarsening, which is a projection of the original o...
متن کاملSpace-Time Discontinuous Galerkin Discretizations for Linear First-Order Hyperbolic Evolution Systems
We introduce a space-time discretization for linear first-order hyperbolic evolution systems using a discontinuous Galerkin approximation in space and a Petrov–Galerkin scheme in time. We show well-posedness and convergence of the discrete system. Then we introduce an adaptive strategy based on goal-oriented dual-weighted error estimation. The full space-time linear system is solved with a para...
متن کاملOn-the-Fly Adaptive Smoothed Aggregation Multigrid for Markov Chains
A new adaptive algebraic multigrid scheme is developed for the solution of Markov chains, where the hierarchy of operators is adapted on-the-fly in a setup process that is interlaced with the solution process. The setup process feeds the solution process with improved operators, while the solution process provides the adaptive setup process with better approximations on which to base further-im...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Scientific Computing
دوره 31 شماره
صفحات -
تاریخ انتشار 2008